منابع مشابه
Permutations with Restricted Position
6. Concluding Remarks. Preliminary analysis indicates that parallel computation, using modular arithmetic, is feasible for certain kinds of problems. The parallel computation envisioned here leads very swiftly to a solution encoded "in modular notation." By this is meant, a system of simultaneous congruences, whose solution (in a specified interval), written as a binary number, has as its initi...
متن کاملA Vector Space Analog of Permutations with Restricted Position
Ever since Kaplansky and Riordan [9-l I] developed their elegant theory of permutations with restricted position, a great variety of combinatorial problems have been explicitly solved, for example, see Dillon and, Roselle [l], Goldman, Joichi, and White [4-S], and Foata, Schutzenberger [2; 31. Spurred by the oft-noted analogy between the case of finite boolean algebras and that of lattices of v...
متن کاملRestricted permutations
Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. They have functioned as a convenient descriptor for several sets of permutations which arise naturally in combinatorics and computer science. We study the partial order on permutations (and more general sequences) that underlies the idea of restriction and which gives rise to sets o...
متن کاملSimple permutations and pattern restricted permutations
A simple permutation is one that does not map any non-trivial interval onto an interval. It is shown that, if the number of simple permutations in a pattern restricted class of permutations is finite, the class has an algebraic generating function and is defined by a finite set of restrictions. Some partial results on classes with an infinite number of simple permutations are given. Examples of...
متن کاملRestricted centrosymmetric permutations
We characterize the sets of centrosymmetric permutations, namely, permutations σ ∈ Sn such that σ(i)+σ(n+1−i) = n+1, that avoid any given family of patterns of length 3. We exhibit bijections between some sets of restricted centrosymmetric permutations and sets of classical combinatorial objects, such as Dyck prefixes and subsets of [n] containing no consecutive integers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1962
ISSN: 0025-5718
DOI: 10.2307/2003061